Construction of Polar Codes for Arbitrary Discrete Memoryless Channels
نویسندگان
چکیده
منابع مشابه
On the Symmetry of Polar Codes for Symmetric Binary-Input Discrete Memoryless Channels
In this paper, we study the symmetry of polar codes on symmetric binary-input discrete memoryless channels (B-DMC). The symmetry property of polar codes is originally pointed out in Arikan’s work for general B-DMC channels. With the symmetry, the output vector y 1 (N be the block length) can be divided into equivalence classes in terms of their transition probabilities. In this paper, we presen...
متن کاملPolar codes for Arbitrary DMCs
Polar codes are constructed for arbitrary channels by imposing an arbitrary quasigroup structure on the input alphabet. Just as with “usual” polar codes, the block error probability under successive cancellation decoding is o(2−N 1/2− ), where N is the block length. The encoding and decoding in this coding scheme can be implemented with a complexity of O(N logN). It is shown that the same techn...
متن کاملAn algorithm for computing the capacity of arbitrary discrete memoryless channels
where here the probability is understood to range over the random choice of code as well as the selection of (r,s). (64) il i=l We find the expected value (over e and s) It follows that d(y,x(r))-+ c@ + 2p in probability and therefore Pr{E,} + 0 as n + co. We are left with the evaluation of Pr{E*}. We write Pr{E,} 5 Pr{d(x(r)& I n(aj + 6p + E), for some r # 1 Ix(l) transmitted} 5 2nRr* Pr{d(x(2...
متن کاملCommitment Capacity of Discrete Memoryless Channels
In extension of the bit commitment task and following work initiated by Crépeau and Kilian, we introduce and solve the problem of characterising the optimal rate at which a discrete memoryless channel can be used for bit commitment. It turns out that the answer is very intuitive: it is the maximum equivocation of the channel (after removing trivial redundancy), even when unlimited noiseless bid...
متن کاملAn Outer Bound to the Admissible Source Region of Discrete Memoryless Arbitrary Varying General Broadcast Channels
In this paper we apply the “potential function method” introduced by the authors in [5] and [6] to prove an outer bound on the admissible source region of an arbitrarily varying general broadcast channel with arbitrarily correlated sources. We are not aware of any previous work discussing any interesting outer bounds on the admissible source region of the general broadcast channel either when t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2018
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2017.2765663